Spectral Reconstruction and Isomorphism of Graphs Using Variable Neighbourhood Search
نویسندگان
چکیده
AMS Mathematics Subject Classification (2000): 05C50, 68P20, 68R10.
منابع مشابه
Spectral Recognition of Graphs1
At some time, in the childhood of spectral graph theory, it was conjectured that non-isomorphic graphs have different spectra, i.e. that graphs are characterized by their spectra. Very quickly this conjecture was refuted and numerous examples and families of non-isomorphic graphs with the same spectrum (cospectral graphs) were found. Still some graphs are characterized by their spectra and seve...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملEntropy Generation of Variable Viscosity and Thermal Radiation on Magneto Nanofluid Flow with Dusty Fluid
The present work illustrates the variable viscosity of dust nanofluid runs over a permeable stretched sheet with thermal radiation. The problem has been modelled mathematically introducing the mixed convective condition and magnetic effect. Additionally analysis of entropy generation and Bejan number provides the fine points of the flow. The of model equations are transformed into non-linear or...
متن کاملRecognition of Polymorphic Patterns in Parameterized Graphs for 3d Building Reconstruction
An approach for the recognition of polymorphic patterns by subgraph isomorphism computation of parameterized graphs will be presented. Parameterized graphs (short: p-graphs) are extensions of undirected graphs by parameter vectors at the nodes and edges. We will deene p-graphs and basic concepts of subgraph isomor-phism computation for p-graphs. A bottom-up algorithm for p-subgraph isomorphism ...
متن کاملGraphs with Given Degree Sequence and Maximal Spectral Radius
We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to an ordering of the vertices induced by breadth-first search. For trees the resulting structure is uniquely determined up to isomorphism. We also show that the largest spec...
متن کامل